Supplemental Material for TKDE - 2011 - 02 - 0065
نویسندگان
چکیده
We distinguish two types of topology changes. Changes in the underlying network topology do not affect our suppression and redundancy schemes, because we operate at the level of suppression edges, which we do not assume to be direct communication edges. Changes in the suppression topology can be handled in a straightforward manner. For each suppression edge i → j that we want to change or create, the base station first learns a new suppression model from the past values of the readings involved (there is no need for any pilot runs because we have already been collecting data). Then, we send the new model to both i and j, which start tracking the suppression state and the transmission history map anew for the suppression edge. Note that changing the topology of cascaded suppression likely involves multiple suppression edges, because we must ensure the property that for each sensor k, there is a path consisting of suppression edges involving k’s reading to the base station, and the error bounds along the path sum up to no more than . Hence, frequent changes to the suppression topology may be costly. In practice, however, for many environmental sensing applications, the sensors are carefully designed and deployed to mitigate the need for frequent topology changes. In particular, cluster heads and those with power-hungry sensors carry more battery capacity, in anticipation of imbalanced energy use. This design effectively avoids topology changes due to load imbalance.
منابع مشابه
Supplemental Material for TKDE - 2015 - 05 - 0359
1 PROPOSED METHODS 1.1 Proofs of Update Rules In this section, we present the proofs of the update rules in Section 3.5 of the main paper. Specifically, we prove the CDTF update rule for L1 regularization (Theorem 7), the CDTF update rule for the nonnegativity constraint (Theorem 8), the SALS update rule for coupled tensor factorization (Theorem 9), and the update rule for bias terms commonly u...
متن کاملA set of 150 pictures with morphologically complex English compound names: norms for name agreement, familiarity, image agreement, and visual complexity.
We present a set of 150 pictures with morphologically complex English compound names. The pictures were collected from various sources and were standardized to appear as grayscale line drawings of a fixed size. All the compounds had two constituents and were primarily of the noun-noun type. Following previous studies, we collected name agreement (percentage and H), familiarity, image agreement,...
متن کاملSupplemental Material to Inference for Parameters Dened by Moment Inequalities: A Recommended Moment Selection Procedure
متن کامل
Lamin - A provides stiff resistance to cell migration
Full Text (HTML) Full Text (PDF) Supplemental Material In This Issue Page 1 of 1 Lamin-A provides stiff resistance to cell migration 2/25/2014 http://jcb.rupress.org/content/early/2014/02/18/jcb.2045iti2?papetoc
متن کامل